Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое graph - определение
WIKIMEDIA DISAMBIGUATION PAGE
Graphs; Graph (disambiguation); Graphing; Graph (mathematics)
Найдено результатов: 936
graph
1. <mathematics> A collection of nodes and edges.
See also connected graph, degree, directed graph, {Moore
bound}, regular graph, tree.
2. <graphics> A visual representation of algebraic equations
or data.
(1996-09-22)
graph
(graphs)
A graph is a mathematical diagram which shows the relationship between two or more sets of numbers or measurements.
N-COUNT
Graph
·add. ·noun A curve or surface, the locus of a point whose coordinates are the variables in the equation of the locus.
II. Graph ·add. ·noun A diagram symbolizing a system of interrelations by spots, all distinguishable from one another and some connected by lines of the same kind.
graph
graph1 [gr?:f, graf]
¦ noun
1. a diagram showing the relation between variable quantities, typically of two variables measured along a pair of axes at right angles.
2. Mathematics a collection of points whose coordinates satisfy a given relation.
¦ verb plot or trace on a graph.
Origin
C19: abbrev. of graphic formula.
--------
graph2 [gr?:f, graf]
¦ noun Linguistics a visual symbol representing a unit of sound or other feature of speech.
Origin
1930s: from Gk graphe 'writing'.
Graph of a function
=−((cosx)^2 + (cosy)^2)^2.PNG?width=200 "Plot of the graph of <math>f(x, y) = - \left(\cos\left(x^2\right) + \cos\left(y^2\right)\right)^2,</math> also showing its gradient projected on the bottom plane.")
![function]] <math>f(x, y) = \sin\left(x^2\right) \cdot \cos\left(y^2\right).</math>](https://commons.wikimedia.org/wiki/Special:FilePath/Three-dimensional graph.png?width=200 "function]] <math>f(x, y) = \sin\left(x^2\right) \cdot \cos\left(y^2\right).</math>")
![interval]] [−2,+3]. Also shown are the two real roots and the local minimum that are in the interval.](https://commons.wikimedia.org/wiki/Special:FilePath/X^4 - 4^x.PNG?width=200 "interval]] [−2,+3]. Also shown are the two real roots and the local minimum that are in the interval.")
REPRESENTATION OF A FUNCTION AS THE SET OF PAIRS (X, F(X))
Graph (function); Graph (functions); Graph of a relation; Function graph; Graphs of functions; Graph of a function of two variables; Graph sketching; Function graphing; Graph of a mapping; Surface plot (mathematics); Graph of a multifunction
In mathematics, the graph of a function f is the set of ordered pairs (x, y), where f(x) = y. In the common case where x and f(x) are real numbers, these pairs are Cartesian coordinates of points in two-dimensional space and thus form a subset of this plane.
Graph (abstract data type)
ABSTRACT DATA TYPE IN COMPUTER SCIENCE
Weighted, directed graph; Graph (computer science); Graph data structure; Graph (data structure); Graph (data structure; Graph representation
In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from the field of graph theory within mathematics.
Graph (topology)
TOPOLOGICAL SPACE
In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph G = (E, V) by replacing vertices by points and each edge e = xy \in E by a copy of the unit interval I = [0,1], where 0 is identified with the point associated to x and 1 with the point associated to y. That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes.
Null graph
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph
![The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.](https://commons.wikimedia.org/wiki/Special:FilePath/Complex tripartite graph octahedron.svg?width=200 "The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.")
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.
